Computer science

\ufeffConsider a four

-

node topology and the link costs are c

(

,

\ufeffx

) = 4,

\ufeffc

(

,

\ufeffy

) = 3,

\ufeff c

(

,

\ufeffz

) = 8,

\ufeffc

(

,

\ufeffw

) = 12,

\ufeffand c

(

,

\ufeffy

) = 3 .

Assume that each node initially knows the costs to each of its neighbors. Compute the distance table after the initialization step and calculate the step

-

-

step distance table entries of each node using the

distance vector routing algorithm for the first

3

\ufefftimestamps only.

N:B: please give me in hand writing and don\'t give me wrong answer kindly

,

\ufeffthanks

Computer science

Answer